Resolution-based Theorem Proving for Many-valued Logics
نویسندگان
چکیده
منابع مشابه
Chaining Techniques for Automated Theorem Proving in Many-Valued Logics
We apply chaining techniques to automated theorem proving in many-valued logics. In particular, we show that superposition specializes to a refined version of the manyvalued resolution rules introduced by Baaz and Fermüller, and that ordered chaining can be specialized to a refutationally complete inference system for regular clauses.
متن کاملResolution-Based Theorem Proving for Manyvalued Logics
A general approach to automated theorem proving for all rst-order nite-valued logics that can be deened truth-functionally is described. The suggested proof procedure proceeds in two, largely independent, steps. First, logic-speciic translation calculi are used to generate clause forms for arbitrary formulas of a many-valued logic. The worst-case complexity of the translation rules is analysed ...
متن کاملResolution-Based Theorem Proving for SHn-Logics
In this paper we illustrate by means of an example, namely SHn-logics, a method for translation to clause form and automated theorem proving for first-order many-valued logics based on distributive lattices with operators.
متن کاملNew Representation Theorem for Many-valued Modal Logics
We propose a new definition of Representation theorem for many-valued modal logics, based on a complete latice of algebraic truth values, and define the stronger relationship between algebraic models of a given logic L and relational structures used to define the Kripke possible-world semantics for L. Such a new framework offers clear semantics for the satisfaction algebraic relation, based on ...
متن کاملA New Representation Theorem for Many-valued Modal Logics
We propose a new definition of the representation theorem for many-valued logics, with modal operators as well, and define the stronger relationship between algebraic models of a given logic and relational structures used to define the Kripke possible-world semantics for it. Such a new framework offers a new semantics for many-valued logics based on the truth-invariance entailment. Consequently...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1995
ISSN: 0747-7171
DOI: 10.1006/jsco.1995.1021